SIAM Journal on Discrete Mathematics -- May 1997

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Discrete Mathematics

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 10, Issue 2, pp. 171-335

Please Note: Electronic articles are available well in advance of the printed articles.

Worst Case Length of Nearest Neighbor Tours for the Euclidean Traveling Salesman Problem

pp. 171-179

BibTeX Abstract Full Text: PDF

A Min-Max Theorem for a Constrained Matching Problem

pp. 180-189

BibTeX Abstract Full Text: PDF

Hypercubes and Multicommodity Flows

B. Yu, J. Cheriyan, and P. E. Haxell

pp. 190-200

BibTeX Abstract Full Text: PDF

Congestion-free Optimal Routings of Hypercube Automorphisms

pp. 201-208

BibTeX Abstract Full Text: PDF

Finding Even Cycles Even Faster

Raphael Yuster and Uri Zwick

pp. 209-222

BibTeX Abstract Full Text: PDF

Load Balancing in Quorum Systems

Ron Holzman, Yosi Marcus, and David Peleg

pp. 223-245

BibTeX Abstract Full Text: PDF

Images and Preimages in Random Mappings

Michael Drmota and Michèle Soria

pp. 246-269

BibTeX Abstract Full Text: PDF

De Bruijn Sequences and Perfect Factors

Chris J. Mitchell

pp. 270-281

BibTeX Abstract Full Text: PDF

On the Dimension of the Hull

Nicolas Sendrier

pp. 282-293

BibTeX Abstract Full Text: PDF

A Min--Max Theorem for Bisubmodular Polyhedra

Satoru Fujishige

pp. 294-308

BibTeX Abstract Full Text: PDF

Decomposing 4-Regular Graphs into Triangle-Free 2-Factors

Edward Bertram and Peter Horák

pp. 309-317

BibTeX Abstract Full Text: PDF

The Structure of Random Graph Orders

Béla Bollobás and Graham Brightwell

pp. 318-335

BibTeX Abstract Full Text: PDF